An Optimizing Method for Embedding Linear Graphs in N-Cube
نویسندگان
چکیده
In this paper a method of embedding a linear graph in n-cube is discussed. Necessary and sufficient conditions on node configurations for the embeddability are obtained by analyzing the structure of n-cube in code space with respect to the distance 2c by means of Reed-Muller code. The fundamental idea in this study is to modify a given graph iteratively in such a manner that the connecting properties of the graph satisfy the above conditions in ascending order of C. An algorithm of modification is mainly based on the classification of node sets. This classification enables us to examine the node-configurations in respect to these conditions. By using this method, we can modify any complex graph into a subgraph of n-cube in such a manner that the total loss of connecting properties becomes as small as possible.
منابع مشابه
Fully Fuzzy Linear Systems
As can be seen from the definition of extended operations on fuzzy numbers, subtraction and division of fuzzy numbers are not the inverse operations to addition and multiplication . Hence, to solve the fuzzy equations or a fuzzy system of linear equations analytically, we must use methods without using inverse operators. In this paper, a novel method to find the solutions in which 0 is not ...
متن کاملLinear Sphericity Testing of 3-Connected Single Source Digraphs
It has been proved that sphericity testing for digraphs is an NP-complete problem. Here, we investigate sphericity of 3-connected single source digraphs. We provide a new combinatorial characterization of sphericity and give a linear time algorithm for sphericity testing. Our algorithm tests whether a 3-connected single source digraph with $n$ vertices is spherical in $O(n)$ time.
متن کاملA cycle embedding problem for Cube-Connected Cycles Graphs
Let n be an odd integer with n ≥ 3. The cube-connected cycles graph CCCn has n × 2 vertices, labeled (l,x), where 0 ≤ l ≤ n − 1 and x is an n-bit binary string. Two vertices (l,x) and (l′,y) are adjacent if and only if either x = y and |l − l′| = 1, or l = l′ and y = (x). In this paper, we will find the set of all possible lengths of cycles in CCCn with n is odd and n ≥ 3 .
متن کاملLOCALLY TRIANGULAR GRAPHS AND NORMAL QUOTIENTS OF THE n-CUBE
For an integer n > 2, the triangular graph has vertex set the 2-subsets of {1, . . . , n} and edge set the pairs of 2-subsets intersecting at one point. Such graphs are known to be halved graphs of bipartite rectagraphs, which are connected triangle-free graphs in which every 2-path lies in a unique quadrangle. We refine this result and provide a characterisation of connected locally triangular...
متن کاملRepresenting graphs as the intersection of axis-parallel cubes
A unit cube in k dimensional space (or k-cube in short) is defined as the Cartesian product R1 × R2 × · · · × Rk where Ri(for 1 ≤ i ≤ k) is a closed interval of the form [ai, ai + 1] on the real line. A k-cube representation of a graph G is a mapping of the vertices of G to k-cubes such that two vertices in G are adjacent if and only if their corresponding k-cubes have a non-empty intersection....
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Information and Control
دوره 17 شماره
صفحات -
تاریخ انتشار 1970